Scheduling groups of tasks with precedence constraints on three dedicated processors

Scheduling groups of tasks with precedence constraints on three dedicated processors

We study the problem of scheduling groups of tasks with precedence constraints on three dedicated processors. Each task requires a speci3ed set of processors. Up to three precedence constraints are considered among groups of tasks requiring the same set of processors. The objective of the problem is to 3nd a nonpreemptive schedule which minimizes the maximum completion time (makespan). This sch...

Scheduling multiprocessor tasks on dedicated processors

Scheduling tasks with AND/OR precedence constraints

In traditional precedence-constrained scheduling a task is ready to execute when all its predecessors are complete. We call such a task an AND task. In this paper we allow certain tasks to be ready when just one of their predecessors is complete. These tasks are known as OR tasks. We analyze the complexity of two types of real-time AND/OR task scheduling problems. In the rst type of problem, al...

Scheduling Tasks with Precedence Constraints on Heterogeneous Distributed Computing Systems

Efficient scheduling is essential to exploit the tremendous potential of high performance computing systems. Scheduling tasks with precedence constraints is a well studied problem and a number of heuristics have been proposed. In this thesis, we first consider the problem of scheduling task graphs in heterogeneous distributed computing systems (HDCS) where the processors have different capabili...

Three-machine Scheduling Problem with Precedence Constraints

This paper deals with a three-machine flow-shop problem in which some of the job sequences are infeasible. It is assumed that jobs are grouped into several disJoint subsets within which a job order is pre-determined. Once the first job in a group has started on a machine, then the entire group must be completed on the machine without starting a job which does not belong to the group. It is furt...